A New Approach to Probabilistic Programming Inference
نویسندگان
چکیده
We introduce and demonstrate a new approach to inference in expressive probabilistic programming languages based on particle Markov chain Monte Carlo. Our approach is simple to implement and easy to parallelize. It applies to Turing-complete probabilistic programming languages and supports accurate inference in models that make use of complex control flow, including stochastic recursion. It also includes primitives from Bayesian nonparametric statistics. Our experiments show that this approach can be more efficient than previously introduced single-site Metropolis-Hastings methods.
منابع مشابه
Variational Inference in Probabilistic Programs a formal derivation of a Black-Box approach
Probabilistic models are used in many elds to tackle di erent problems, ranging from image recognition to diagnosing diseases. The advantage of using models is that we can split the encoding of our problem into a probabilistic model from the ways we solve it. We can also classify models to develop some class-speci c, but not problem-speci c algorithms to solve given tasks. These algorithms are ...
متن کاملAugur: a Modeling Language for Data-Parallel Probabilistic Inference
It is time-consuming and error-prone to implement inference procedures for each new probabilistic model. Probabilistic programming addresses this problem by allowing a user to specify the model and having a compiler automatically generate an inference procedure for it. For this approach to be practical, it is important to generate inference code that has reasonable performance. In this paper, w...
متن کاملMulti-choice stochastic bi-level programming problem in cooperative nature via fuzzy programming approach
In this paper, a Multi-Choice Stochastic Bi-Level Programming Problem (MCSBLPP) is considered where all the parameters of constraints are followed by normal distribution. The cost coefficients of the objective functions are multi-choice types. At first, all the probabilistic constraints are transformed into deterministic constraints using stochastic programming approach. Further, a general tran...
متن کاملProbabilistic Theorem Proving: A Unifying Approach for Inference in Probabilistic Programming
Inference is the key bottleneck in probabilistic programming. Often, the main advantages of probabilistic programming – simplicity, modularity, ease-of-use, etc. – are dwarfed by the complexity and intractability of inference. In fact, one of the main reasons for the scarcity/absence of large applications and real-world systems that are based in large part on probabilistic programming languages...
متن کاملMulti-item inventory model with probabilistic demand function under permissible delay in payment and fuzzy-stochastic budget constraint: A signomial geometric programming method
This study proposes a new multi-item inventory model with hybrid cost parameters under a fuzzy-stochastic constraint and permissible delay in payment. The price and marketing expenditure dependent stochastic demand and the demand dependent the unit production cost are considered. Shortages are allowed and partially backordered. The main objective of this paper is to determine selling price, mar...
متن کامل